Prime Order Primitive Subgroups in Torus-Based Cryptography
نویسنده
چکیده
We use the Bateman-Horn conjecture to study the order of the set of Fq-rational points of primitive subgroups that arise in torus-based cryptography. We provide computational evidence to support the heuristics and make some suggestions regarding parameter selection for torus-based cryptography.
منابع مشابه
Torus-Based Cryptography
In a series of three lectures, we will introduce the main concepts behind torus-based cryptography. Algebraic tori were suggested in 2003 by K. Rubin and A. Silverberg for use in public-key cryptography. Torus-based cryptosystems are based on the Discrete Logarithm Problem in a subgroup of Fqn called the primitive subgroup. It is conjectured that the elements of the primitive subgroup can be re...
متن کاملThe Function Field Sieve in the Medium Prime Case
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime power. This approach is an alternative to a recent paper of Granger and Vercauteren for computing discrete logarithms in tori, using efficient torus representations. We show that when q is not too large, a very efficien...
متن کاملCompression in Finite Fields and Torus-Based Cryptography
We present efficient compression algorithms for subgroups of multiplicative groups of finite fields, we use our compression algorithms to construct efficient public key cryptosystems called T2 and CEILIDH, we disprove some conjectures, and we use the theory of algebraic tori to give a better understanding of our cryptosystems, the Lucas-based, XTR and Gong-Harn cryptosystems, and conjectured ge...
متن کاملFinite groups with $X$-quasipermutable subgroups of prime power order
Let $H$, $L$ and $X$ be subgroups of a finite group$G$. Then $H$ is said to be $X$-permutable with $L$ if for some$xin X$ we have $AL^{x}=L^{x}A$. We say that $H$ is emph{$X$-quasipermutable } (emph{$X_{S}$-quasipermutable}, respectively) in $G$ provided $G$ has a subgroup$B$ such that $G=N_{G}(H)B$ and $H$ $X$-permutes with $B$ and with all subgroups (with all Sylowsubgroups, respectively) $...
متن کاملDimension and enumeration of primitive ideals in quantum algebras
In this paper, we study the primitive ideals of quantum algebras supporting a rational torus action. We first prove a quantum analogue of a Theorem of Dixmier; namely, we show that the Gelfand-Kirillov dimension of primitive factors of various quantum algebras is always even. Next we give a combinatorial criterion for a prime ideal that is invariant under the torus action to be primitive. We us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2006 شماره
صفحات -
تاریخ انتشار 2006